Termination Proof Script
Consider the TRS R consisting of the rewrite rule
There is one dependency pair:
The approximated dependency graph contains one SCC:
{2}.
-
Consider the SCC {2}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006